Explicit Substitutions for Contextual Type Theory
نویسندگان
چکیده
منابع مشابه
Explicit Substitutions for Contextual Type Theory
In this paper, we present an explicit substitution calculus which distinguishes between ordinary bound variables and meta-variables. Its typing discipline is derived from contextual modal type theory. We first present a dependently typed lambda calculus with explicit substitutions for ordinary variables and explicit meta-substitutions for meta-variables. We then present a weak head normalizatio...
متن کاملPure Type Systems, Cut and Explicit Substitutions
Pure type systems are a general formalism allowing to represent many type systems – in particular, Barendregt’s λ-cube, including Girard’s system F , dependent types, and the calculus of constructions. We built a variant of pure type systems by adding a cut rule associated to an explicit substitution in the syntax, according to the Curry-Howardde Bruijn correspondence. The addition of the cut r...
متن کاملIntersection Type Systems and Explicit Substitutions Calculi
The λ-calculus with de Bruijn indices, called λdB, assembles each α-class of λ-terms into a unique term, using indices instead of variable names. Intersection types provide finitary type polymorphism satisfying important properties like principal typing, which allows the type system to include features such as data abstraction (modularity) and separate compilation. To be closer to computation a...
متن کاملExplicit substitutions for control operators ?
The-calculus is a-calculus with a local operator closely related to normal-isation procedures in classical logic and control operators in functional programming. We introduce exp, an explicit substitution calculus for , show it preserves strong normali-sation and that its simply typed version is strongly normalising. Interestingly, exp is the rst example for which the decency method of showing ...
متن کاملExplicit Substitutions for Constructive Necessity
This paper introduces a -calculus with explicit substitutions, corresponding to an S4 modal logic of constructive necessity. As well as being semantically well motivated, the calculus can be used (a) to develop abstract machines, and (b) as a framework for specifying and analysing computation stages in the context of functional languages. We prove several syntactic properties of this calculus,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2010
ISSN: 2075-2180
DOI: 10.4204/eptcs.34.3